Using models to model-check recursive schemes
نویسندگان
چکیده
منابع مشابه
Using Models to Model-Check Recursive Schemes
We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, λY calculus, is equivalent to schemes, we propose the use of a model of λY -calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a ...
متن کاملAdequate Models for Recursive Program Schemes
This thesis is a pedagogical exposition of adequacy for recursive program schemes in the monotone frame. Adequacy relates the operational and denotational meanings of a term; it states that for any term of base type, the operational and denotational meanings are identical. Adequacy is typically proved in the continuous frame. This is a pedagogically questionable step; in order to prove adequacy...
متن کاملUsing Recursive Agent Models Effectively
We present an algorithm that an agent can use for determining which of its nested, recursive models of other agents are important to consider when choosingan action. Pruning away less important models allows an agent to take its “best” action in a timely manner, given its knowledge, computational capabilities, and time constraints. We describe a theoretical framework, based on situations, for t...
متن کاملHow to Check Urinary Incontinence
دیواره مثانه شامل شبکه انبوهی از فیبرهای عضلانی صاف می باشد که از افزایش ناگهانی فشار مثانه که منجر به انقباض و نشت ادرار از مثانه قبل از پرشدن کامل آن می شود جلوگیری می کند و حدود ۵۰۰ سی سی ادرار را در خود جای می دهد. مجرای پیشابراه که بعنوان محل خروجی برای مثانه محسوب می شود شامل دو لایه عضله صاف و یک ناحیه تنگ شده عضلانی است که تحت کنترل ارادی می باشد و بعنوان اسفنکتر خارجی عمل می کند. هنگام...
متن کاملUsing induction and BDDs to model check invariants
We present an inductive characterization for an invariant to stand in a given finite-state transition system. We show how this characterization can be computed by means of BDD-based operations, without performing a fixpoint iteration over sets of states as the CTL symbolic model checking algorithm does.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(2:7)2015